Method for controlling an automated or autonomous locomotive device, and evaluation unit

ABSTRACT

A method for controlling an automated or autonomous locomotive device, including automatically ascertaining a deviation from a predefined trajectory, the deviation requiring a return of the locomotive device to the predefined trajectory; automatically calculating a jerk as an input variable, as a function of the deviation from the predefined trajectory; automatically calculating an unconstrained correcting variable for the return to the predefined trajectory, as a function of a weighted sum that includes a weighted summand of the input variable and a weighted summand of the state for the return path; automatically calculating a constrained correcting variable regarding the jerk; the unconstrained correcting variable being manipulated via a cascade that includes multiple stages having one saturation function per stage; integrating the constrained correcting variable, to obtain a constrained return trajectory to the predefined trajectory; automatically steering the locomotive device to the predefined trajectory by way of the constrained return trajectory.

CROSS REFERENCE

The present application claims the benefit under 35 U.S.C. § 119 of German Patent Application No. DE 102018222783.7 filed on Dec. 21, 2018, which is expressly incorporated herein by reference in its entirety.

FIELD

The present invention relates to a method for controlling an automated or autonomous locomotive device, as well as to an evaluation unit of a locomotive device.

BACKGROUND INFORMATION

With the continuous evolution of highly automated and autonomous vehicles, the relevance of trajectory planning is also growing. In this context, the requirements for trajectory planning may be varied. They extend from the planning of a comfortable trajectory to the lane change on the highway, up to the safety-related avoidance maneuver in urban and rural traffic. Thus, high demands, such as the adherence to particular comfort or safety criteria or the prediction of critical situations, are often placed on the trajectory planning as a function of the request. In addition, it must be possible to compute the trajectories in real time, since they must followed during current vehicle operation. In order to satisfy this requirement, polynomial-based approaches are discussed in the relevant literature. Polynomial-based design approaches do possess real-time capability, but have the disadvantage that constraints may not be taken explicitly into account in a simple manner. In addition, the asymmetric driving behavior of a person may only be simulated with difficulty, by polynomials of low order over a relatively long time horizon. For example, a human driver initiates a lane change more dynamically than he/she ends it. Model predictive control (MPC) constitutes an option for integrating constraints and asymmetric behavior in the trajectory planning. In this connection, however, since optimization problems must be solved continuously in view of constraints, MPC-based planning requires very high computing power, in order to be real-time capable. However, given the standard capacity utilization of control units, which are used in today's vehicles, such high computing power may not be ensured.

SUMMARY

According to a first aspect, the present invention relates to a method for controlling an automated or autonomous locomotive (locomotion, transport) device. In the spirit of the present invention, automobiles, in particular, passenger cars and/or cargo trucks and/or motorcycles and/or airplanes and/or ships come into consideration. A locomotive device operable in an “autonomous” and/or “automated” manner may presently be understood as at least a locomotive device, which is able, for example, using an evaluation unit, to plan a trajectory independently and additionally move independently on this trajectory. In a first step, the method of the present invention includes ascertaining a deviation, e.g., of a path, which requires a return to a predefined trajectory. Such ascertainment of the deviation may be carried out, in particular, by the locomotive device, for example, using an evaluation unit, for example, a CPU and/or a microcontroller or an electronic control unit. Further dynamic system variables currently available, such as the speed and/or the acceleration, which may be ascertained by a conventional locomotive-device sensor system, may also be taken into account for the ascertainment of the deviation. A “predefined trajectory” may be understood as a global trajectory, which runs, for example, on a reference line or reference curve of a Frenet coordinate system. The global trajectory may be planned, for example, at or prior to the start of the trip and does not consider any eventualities, which, due to different routing or due to obstacles, would signify a necessity of deviating from this trajectory. A deviation and/or necessity of a return to this predefined trajectory may occur, for example, on the basis of sensory data of the vehicle, which come, for example, from an ultrasonic sensor and/or a camera and/or a lidar sensor and/or a radar sensor and/or an accelerometer and/or a speedometer. A deviation may be justified by an obstacle, which means that the locomotive device must deviate from the predefined trajectory. The obstacle may be detected or ascertained sensorially. In addition, because of the ascertained deviation, in particular, a roadway corridor is formed, which results due to obstacles and roadway boundaries. In response to the ascertainment of a deviation, a jerk in the form of an input variable is automatically computed as a function of the deviation. For example, a deviation from the predefined reference trajectory, e.g., a distance, and/or a current acceleration and/or a current velocity of the locomotive device may be utilized for calculating the jerk. Starting from the input variable, an unconstrained correcting variable is automatically computed for returning to the predefined trajectory. Presently, a “correcting variable” is understood, in the control-engineering sense, as an output variable of a utilized control element (for example, an evaluation unit);

A targeted intervention in the controlled member of the system, that is, of the locomotive device, is able to take place via the output variable and/or correcting variable, on the basis of the input variable (the jerk). However, the unconstrained correcting variable does not act directly upon the system. On the contrary, further manipulation steps take place, which are explained below. The unconstrained correcting variable for returning to the predefined trajectory is calculated as a function of a weighted sum that includes a weighted summand of the input variable and a weighted summand of a state and/or weighted summands of further states of the return path. In this connection, the summand of the input variable may also have a weighting of zero. In addition, further states may be considered. In particular, each state receives a weighted summand, in order to compute the unconstrained correcting variable. The unconstrained correcting variable is limited by the saturation cascade. After thrice integrating an output value obtained in this manner, with respect to time, a state may be obtained, which acts directly upon the locomotive device. For the next instant, this operation is repeated, starting from the current state, etc. For example, the velocity, the jerk, the acceleration and/or the position of the locomotive device come into consideration as a “state.” In this connection, the state is calculated, in particular, as a function of the deviation from the predefined trajectory. For example, the state may be ascertained sensorially. In particular, for a specific lateral or longitudinal or vertical motion of the locomotive device, assuming that the enumerated motions are decoupled from each other, in the case of the deviation, the state is ascertained for the respective acceleration, velocity and position of the vehicle and transformed to a state space. For example, the planning of the unconstrained correcting variable may be regarded as a state return path, which means that starting from an initial condition, the locomotive device may be stabilized asymptotically so as to approach the predefined reference trajectory. For example, a return matrix may be calculated for this with the aid of pole selection and/or a linear quadratic regulator (LQR) method. Based on the use of the weighted sum and its simple arithmetic processing, a required computing speed or power may be reduced by a factor of 10 to 100 in comparison with predictive modeling approaches. In a subsequent step, a constrained correcting variable with regard to the jerk is computed automatically. In this connection, the unconstrained correcting variable is manipulated via a cascade of a plurality of stages. For this, a saturation function regarding a dynamic system state is provided for each stage of the cascade. The saturation function constitutes a constraint, which is undertaken within the stage of the cascade with regard to a dynamic system state. A dynamic system state may contain, for example, a jerk, which, according to the physical definition, includes the third derivative of the distance with respect to time. In this connection, a deviation from a predefined reference trajectory may be ascertained, in particular, one used for the lateral coordinate. In simplified terms, it may be assumed, in particular, that the lateral and the longitudinal motion of the locomotive device are decoupled; at least a constant longitudinal movement being assumed in the determination of the return trajectory for the lateral movement. In the case of a Frenet coordinate system, the time characteristic of the distance of the predefined trajectory, as well as of the length of the curve of the predefined trajectory, may be used in order to compute, in each instance, a jerk from this. In particular, the characteristic curve of the jerk may be used, in this case, as a correcting variable. Mathematical models, which result from these assumptions, may be transformed, in particular, in a state space. In response to that, the constrained correcting variable is integrated in a time-dependent manner, e.g., integrated three times with respect to time, in order to obtain the constrained return trajectory, that is, which contains the constraint data from the cascade with regard to dynamic system states (e.g., jerk and/or acceleration). In a final step, the locomotive device is automatically steered towards the predefined trajectory by way of a constrained return trajectory. This may be accomplished, e.g., with the aid of a controller. Thus, using the method of the present invention, a jerk is limited to the effect that a comfortable trajectory plan may be carried out. For example, the steps discussed above may be ascertained and carried out by an evaluation unit, for example, a CPU and/or a microcontroller and/or an electronic control unit. Thus, in the preceding, trajectory planning may be provided, which, in comparison with classic planning approaches based on polynomials of higher order, may also be used for asymmetric driving behavior (by taking into account the jerk as an input and output variable) and may take constraints into account.

Preferred further refinements of the present invention are described herein.

According to one advantageous further refinement of the present invention, the dynamic system state includes a jerk and/or a velocity and/or an acceleration and/or a position of the locomotive device. The dynamic system state may relate to, in particular, a longitudinal and/or lateral and/or a vertical trajectory component of the locomotive device. Consequently, all of the relevant, dynamic system states, which are necessary for trajectory planning, may be used within the method of the present invention in a computationally efficient manner.

According to a further advantageous refinement of the method according to the present invention, the constrained return trajectory includes a longitudinal and/or a lateral and/or a vertical component. A vertical trajectory component may then be relevant, in particular, if the locomotive device is an airplane. If the method of the present invention is carried out for a lateral trajectory component, then, in particular, a constant longitudinal velocity is always assumed in spite of the simplified decoupling assumption of the two trajectory components.

According to one advantageous further refinement of the method of the present invention, the cascade may include two to four stages. The cascade ideally includes four stages. Therefore, all of the constraint data (e.g., jerk, acceleration, position and velocity) necessary for the planning of the constrained return trajectory may be considered without requiring a high computing capacity.

According to a further advantageous refinement of the method of the present invention, the saturation function may be ascertained as a function of predefined constraints. In this manner, variant-rich initial conditions for the generation of saturation functions may be set specifically to the need, in order to model asymmetric human driving behavior as realistically as possible. For example, a predefined constraint regarding the position of the locomotive device may include coordinates of a roadside for calculating a limiting corridor. Additionally, or as an alternative, a maximum jerk and/or a maximum acceleration may be predefined as a function of test studies. For example, a maximum jerk and/or a maximum acceleration may be defined, in each instance, as a maximum value, the exceedance of which causes unease in a representative group of test subjects. A current state of the locomotive device (with regard to acceleration and/or position and/or velocity) may be estimated, for example, as a function of corresponding sensorial data of the locomotive device.

According to a further advantageous refinement of the method according to the present invention, the automatic determination of the constraint does not vary with time. In this manner, computing power may be conserved while neglecting the time component.

According to one advantageous embodiment of the method of the present invention, a later step, that is, a manipulation of the correcting variable in a later stage of the cascade, is preferred over an earlier step, that is, a manipulation of the correcting variable in an earlier step of the cascade. In other words, this means that the unconstrained correcting variable passes through individual saturation functions, which may be associated with the constraints of the individual states. If different constraints are competing, that is, there is no physically meaningful solution for all of the constraints, then the constraint, that is, the manipulation, using the saturation function that occurs later in the cascade, is dominant, since this may overwrite the adaptation of the preceding saturation steps. This is also called “prioritization.” Due to this, one or more given constraints having a lower priority, such as comfort, may be deliberately violated, it the problem may no longer be solved in view of all of the constraints. This makes the trajectory planning of the present invention, that is, the method of the present invention, highly robust for solving a trajectory planning problem, while at the same time, only a fraction of the computing power of an MPC method is needed.

According to a further advantageous refinement of the method according to the present invention, this includes a step of sensorial detection of an obstacle by the locomotive device. For example, the obstacle may be detected sensorially with the aid of a lidar sensor and/or a camera sensor and/or a radar sensor and/or an ultrasonic sensor. In addition, an obstacle may also be detected on the part of the vehicle, based on received data, for example, real-time traffic information data.

According to a further advantageous refinement of the method according to the present invention, this includes the step of calculating a return matrix, on the basis of which the return trajectory is automatically ascertained with regard to the dynamic system state. In particular, the return matrix may be understood to describe the dynamics of how rapidly the return trajectory is lead back to the predefined reference. For example, the return matrix may be computed prior to the start of the trip, that is, offline. Therefore, the present trajectory planning has real-time capability. Since the return matrices for the method of the present invention do not have to be computed during the trip, this method is sufficiently discrete and efficient with regard to computing power.

The following aspect of the present invention accordingly includes the advantageous embodiments and further refinements having the above-mentioned features, as well as the general advantages of the method of the present invention and the respective technical effects associated with them. In order to prevent repetition, a new listing is therefore omitted.

According to a second aspect, the present invention relates to an evaluation unit of a locomotive device; the evaluation unit being configured to implement a method according to the first aspect of the present invention. In particular, the evaluation unit may be rigidly installed in onboard electronics of the locomotive device. According to the present invention, it is, in particular, not necessary to plan a trajectory, using an external server. In particular, the method of the present invention is so computationally efficient, that it may easily be implemented in an evaluation unit of a locomotive device.

BRIEF DESCRIPTION OF THE DRAWINGS

Below, exemplary embodiments of the present invention are described in detail with reference to the figures.

FIG. 1 shows a flow chart of a variant of the method according to the present invention.

FIG. 2 shows an illustration of a Frenet coordinate system.

FIG. 3 shows an illustration of the processing of a state of the method according to the present invention.

FIG. 4 shows an illustration of a cascade of the method according to the present invention.

FIG. 5a shows an illustration of a cascade for the planning of a lateral trajectory.

FIG. 5b shows a further illustration of a cascade for the planning of a lateral trajectory.

FIG. 6a shows an illustration of a cascade for the planning of a longitudinal trajectory.

FIG. 6b shows a further illustration of a cascade for the planning of a longitudinal trajectory.

FIG. 7 shows another illustration of a cascade for trajectory planning.

FIG. 8 shows an illustration of a control engineering sequence for calculating a state sum.

DETAILED DESCRIPTION OF EXAMPLE EMBODIMENTS

FIG. 1 illustrates a flow chart of a variant of a method according to the present invention. In a first step 100, in particular, an obstacle is detected sensorially by locomotive device 1. In response to that, in a second step 200, a deviation, which requires a return to a predefined trajectory 2 of locomotive device 1, is ascertained by locomotive device 1. A trajectory, which is necessary for this, is planned in the Frenet coordinate system. Such a coordinate system, including locomotive device 1 and predefined trajectory 2, is shown in FIG. 2. This coordinate system is kinematically bound to a predefined trajectory 2 by base point r(s) and describes the setpoint position and setpoint orientation of locomotive device 1 at any time with respect to an inertial system. In this context, longitudinal coordinate s(t) describes the arc length along predefined trajectory 2. The distance of locomotive device 1 perpendicular to predefined trajectory 2 corresponds to lateral coordinates d(t). A triple integrator is used to describe the dynamics (that is, the deviation from predefined trajectory 2) of locomotive device 1 in such a Frenet coordinate system; the jerk being viewed as an input variable of the system. As a result:

$\begin{matrix} {{\frac{d^{3}{d(t)}}{{dt}^{3}} = {{(t)} = {u_{lat}(t)}}},} & (1) \\ {\frac{d^{3}{s(t)}}{{dt}^{3}} = {{(t)} = {{u_{long}(t)}.}}} & (2) \end{matrix}$

Thus, in a third step 300, an input variable of a jerk is calculated. In this case, t is the time. In this context, it is accordingly assumed that the lateral and longitudinal motions are decoupled. The models are then transformed to the state space, using the state x(t)=[d(t) {dot over (d)}(t) {umlaut over (d)}(t)]^(T) or x(t)=[s(t) {dot over (s)}(t) {umlaut over (s)}(t)]^(T). Given the initial condition x₀=x(0), the differential equation system according to equation (3) is

$\begin{matrix} {{{\overset{.}{x}(t)} = {{\underset{\underset{A}{}}{\begin{bmatrix} 0 & 1 & 0 \\ 0 & 0 & 1 \\ 0 & 0 & 0 \end{bmatrix}}{x(t)}} + {\underset{\underset{B}{}}{\begin{bmatrix} 0 \\ 0 \\ 1 \end{bmatrix}}{u_{\{{{lat},{long}}\}}(t)}}}},{{x\left( t_{0} \right)} = x_{0}}} & (3) \end{matrix}$

The trajectory planning may now take place on the basis of the linear state space representation of the longitudinal and lateral dynamics. According to FIG. 3, the problem of the unconstrained trajectory planning is initially solved in a first step, before state constraints and correcting variable constraints are subsequently taken into account in a downstream step. In this context, the constraints may be derived, in particular, directly with regard to technical requirements in view of a maximum jerk, a maximum lateral acceleration, or the like. In a fourth step 400, an unconstrained correcting variable is calculated automatically as a function of a weighted sum including weighted summands of the states. In this connection, for a highly dynamic trajectory, the states may be weighted more heavily in the calculation of the state return path with the aid of LQR methods. If, however, a more comfortable trajectory having a lower jerk is needed, then the weighting of the jerk may be selected to be higher than the weighting of the states.

In this connection, for the planning of a return trajectory, a state return path u_(c)(t)=−K(x*−x(t)) is calculated, which, starting out from an initial condition x(0)=x₀, stabilizes system 6 so as to approach a predefined trajectory 2 asymptotically, which also means: x(t)→x*, t→∞. For this, state x(t) must be completely known, which, however, is fulfilled for the purely model-based planning task. In a fourth step 400, a calculation of return matrix K is made, which is carried out with the aid of a pole selection or the LQR method, with a finite or infinite horizon, or with the aid of similar methods. In this context, the unconstrained dynamics of the return trajectory may be set as a function of the position of the poles or weighting of the individual states. For a more detailed description of this action, reference is made to Lunze, J: Regelungstechnik 2: Mehrgrößensysteme Digitale Regelung, [Control Engineering 2: Multivariable Systems Digital Control], Springer Publishing House, 2013.

In a fifth step 500, a constrained correcting variable regarding the dynamic system state is calculated automatically as a function of a predefined constraint and a current state of locomotive device 1. To this end, the unconstrained correcting variable with regard to the dynamic system state is varied as a function of a predefined constraint. In other words, the correcting variable characteristic from the unconstrained correcting variable is adapted in such a manner, that constraints with regard to the correcting variable and the states may be adhered to. This is accomplished, in particular, on the basis of a cascade of saturation elements having state-dependent, upper and lower constraints, as is shown, for example, in FIG. 4. In this context, the order of these elements or stages in the cascade represents the prioritization of the corresponding constraints. The closer the constraint is to the output of the cascade, the higher the corresponding priority is. In FIG. 4, a cascade having different stages 7 a through 7 c is shown as an example. In this connection, e.g., the priorities become higher from first state x₁ along the integrator chain, up to output u. If the constraints for this system are prioritized according to this, then the order is: 1. u, 2. x₃, 3. x₂, 4. x₁. In this connection, u is defined as jerk, x₄ as acceleration, x₂ as velocity and x₁ as position; four describing the highest and one describing the lowest priority. However, in general, the order of saturation may be selected freely. An advantage of prioritizing the constraints is that if it should no longer be possible to physically adhere to all of the constraints, then the constraint having the lowest priority is automatically violated, in order to be able to find a solution, nevertheless. Specifically, this means that, for example, a comfort criterion is violated in order to adhere to a safety criterion.

In this context, the calculation of the state-dependent saturation is as follows: Initially, the time-dependent and polytopic state constraints

P={x∈

³ |Fx(t)−g(t)≤0}  (4)

are defined for the states with F∈

^(n) ^(c) ^(x3) g∈

^(n) ^(c) , where n_(c) is the number of state constraints. The time-dependent correcting variable constraint is expressed by equation (5)

u _(min)(t)≤u(t)≤u _(max)(t).  (5)

In this connection, u_(min) is the minimum jerk, and u_(max) is the maximum jerk. The calculation of all of the correcting variables for adhering to the upper and lower constraints is carried out, using equations (6) and (7)

γ_(⊕)(t)∈{γ_(⊕,in),γ_(⊕,1), . . . ,γ_(⊕,n) _(c,+) },  (6)

γ_(⊖)(t)∈{γ_(⊖,in),γ_(⊖,1), . . . ,γ_(⊖,n) _(c,−) },  (7)

for the saturation cascade having the unconstrained correcting variable as an input, in accordance with the action described in Joos, S.; Bitzer, M.; Karrelmeyer, R.; Graichen, K.: “Prioritization-based switched feedback control for linear SISO systems with time-varying state and input constraints” in European Control Conference (ECC), Limassol, Cyprus, 2018, pp. 2935-2940, and in view of the state and correcting variable constraints from equations (4) and (5), defined in advance. In this connection, γ_(⊕,in), γ_(⊕,1), . . . , γ_(⊕,n) _(c,+) are the calculated maximum values of the saturation cascade. γ_(⊖,in), γ_(⊖,1), . . . , γ_(⊖n) _(c,−) are the calculated minimum values of the saturation cascade. In a further step, the unconstrained correcting variable is adapted in accordance with the priortization of the constraints in the cascade. If the constraints are not active at any moment, the cascade does not change the unconstrained correcting variable. The resulting correcting variable is then applied to the model of the longitudinal and lateral dynamics according to equation (3). The constrained correcting variable from the output of the saturation cascade is subsequently integrated three times, in order to obtain the constrained trajectory (step 600). Finally, in a seventh step 700, locomotive device 1 is automatically steered back to predefined trajectory 2 via the constrained return trajectory regarding the dynamic system state.

FIG. 3 shows a flow chart including a state controller 4, consideration of constraints 5, and a system 6. The input variable of state controller 4 is initially the deviation of the setpoint state and actual state. The output variable (jerk) of state controller 4 is the unconstrained correcting variable, which is constrained by taking into account constraints 5.

Consequently, a constrained correcting variable is obtained, which is integrated three times, in order to obtain the constrained return trajectory, which then acts upon system 6, that is, locomotive device 1.

FIG. 4 shows a cascade according to Joos, S.; Bitzer, M.; Karrelmeyer, R.; Graichen, K.: “Prioritization-based switched feedback control for linear SISO systems with time-varying state and input constraints” in European Control Conference (ECC), Limassol, Cyprus, 2018, pp. 2935-2940. In this connection, stages 7 a, 7 b, 7 c of the cascade are shown. In this case, stage 7 b is prioritized over stage 7 a, and stage 7 c is prioritized over stage 7 b. In other words, a constraint of stage 7 a is removed in stage 7 b, if, on the basis of the cascade, an unsolvable task of the correcting variable present in the cascade would arise.

FIG. 5a shows an illustration of a solution of an LQR method for planning a lateral trajectory in view of upper and lower constraints 8 a through 8 d and 9 a through 9 d, respectively. In this connection, the resulting local trajectory of the state of position 10 a is shown in the uppermost illustration for the position of locomotive device 1. In addition, predefined, global trajectory 2 is illustrated as a dashed line. In this case, the characteristic of the resulting local trajectory, that is, of the altered return trajectory, approaches predefined trajectory 2 asymptotically. In this connection, the following prioritization for the dynamic system states is given: 1. jerk, 2. acceleration, 3. velocity, 4. position. In other words, this means that the jerk of locomotive device 1 has the highest priority and the position of locomotive device 1 has the lowest priority. In this case, the first through fourth states 10 a to 10 d are constrained from the top to the bottom. In this connection, FIG. 5b includes a different prioritization; the position having the highest priority, the velocity having the second highest priority, the acceleration having the third highest priority, and the jerk having the fourth highest priority.

FIG. 6a shows the solution of an LQR method for planning a longitudinal trajectory in view of upper and lower constraints 8 a through 8 d and 9 a through 9 d, respectively. In this connection, first state 10 a is unconstrained with regard to the position. Second state 10 b approaches predefined trajectory 2 asymptotically. In this case, upper constraints 8 b through 8 d and lower constraints 9 b through 9 d of states 10 a through 10 d are shown, as well. The prioritization in FIG. 6a is as follows: 1. jerk, 2. acceleration, 3. velocity. FIG. 6b shows trajectory planning regarding a state 10 a through 10 d for the longitudinal trajectory planning. In this case, the first through third states 10 a through 10 c are prioritized as follows: 1. velocity, 2. acceleration, and 3. jerk.

FIG. 7 shows a further variant of a saturation cascade. In this case, the unconstrained correcting variable passes through, from above to below, the individual saturation functions, which may be assigned to the constraints of the individual states 10 a through 10 d (from top to bottom: position, velocity, acceleration, as well as jerk). In this connection, one constraint cascade from above to below is shown in each of the first four diagrams. If different constraints are competing, that is, there is no solution for all of the constraints of the cascade, then the constraint, which occurs later in the cascade, is dominant, since these adaptations overwrite the preceding saturation steps. In this case, the specific state 10 a-10 d, which runs outside of the upper and lower constraints 8 a through 8 d and 9 a through 9 d, respectively, is drawn in as a dashed line. Due to the constraint cascade, these correcting variables running on the outside are adapted to the effect that they adhere to the constraints. This is shown by the solid lines of states 10 a through 10 d, which run inside of the upper and lower constraints 8 a through 8 d and 9 a through 9 d, respectively. The constrained trajectory 10 e for the return path to predefined trajectory 2 results from the constraints 8 a through 8 d and 9 a through 9 d.

FIG. 8 shows a flow chart for calculating a state sum. For this, state x₃ may represent an acceleration, state x₂ may represent a velocity, and state x₁ may represent a position of the locomotive device. In this case, jerk u is not taken into account for calculating the state sum. In other words, jerk u receives a weighting summand of 0. A state sum of states x₁ through x₃ is calculated at the input of constraint 5. In this connection, each of these states x₁ through x₃ may have a different weighting. Depending on the desire as to which state should be taken into account more or less highly, the respective state may be weighted more or less heavily. The jerk is obtained as an output from constraint 5. This is integrated with respect to time, in order to obtain state x₁. In addition, state x₁ is integrated, in order to obtain state x₂, etc. In this connection, in particular, x₁ acts upon the controller of locomotive device 1. In this manner, in particular, a constrained correcting variable (11) may be determined for the controller for each instant t, in order to lead locomotive device 1 back to predefined trajectory 2. 

What is claimed is:
 1. A method for controlling an automated or autonomous locomotive device, comprising the following steps: automatically ascertaining a deviation from a predefined trajectory, the deviation requiring a return of the locomotive device to the predefined trajectory; in response to the automatic ascertainment, automatically calculating a jerk as an input variable, as a function of the deviation from the predefined trajectory; automatically calculating an unconstrained correcting variable for the return to the predefined trajectory, as a function of a weighted sum including weighted summands of states for the return, which is a function of the input variable; automatically calculating a constrained correcting variable regarding the jerk, by manipulating the unconstrained correcting variable, using a cascade that includes a plurality of stages having one saturation function per stage, each stage of the plurality of stages including a saturation function regarding a specific dynamic system state; integrating the constrained correcting variable with respect to time, in order to obtain a constrained return trajectory to the predefined trajectory; and in response to the obtaining of the constrained return trajectory, automatically steering the locomotive device to the predefined trajectory using the constrained return trajectory.
 2. The method as recited in claim 1, wherein in each instance, the dynamic system state includes the jerk of the locomotive device and/or a velocity of the locomotive device and/or an acceleration of the locomotive device and/or a position of the locomotive device.
 3. The method as recited in claim 1, wherein the constrained return trajectory includes a longitudinal component and/or a lateral component and/or a vertical component.
 4. The method as recited in claim 1, wherein the cascade includes two to four stages.
 5. The method as recited in claim 1, wherein the saturation function is ascertained as a function of predefined constraints.
 6. The method as recited in claim 5, wherein the saturation function is ascertained invariantly over time.
 7. The method as recited in claim 1, wherein a later step is prioritized over an earlier step in the cascade.
 8. The method as recited in claim 1, further comprising the following step: sensorially detecting an obstacle, using the locomotive device, and on the basis of the sensorial detection, deviating from the predefined reference trajectory.
 9. The method as recited in claim 1, further comprising the following step: calculating a return matrix for the unconstrained correcting variable, using pole selection and/or using a linear quadratic regulator method.
 10. An evaluation unit of an automated or autonomous locomotive device, the evaluation unit being configured to control the locomotive device, the evaluation unit configured to: automatically ascertain a deviation from a predefined trajectory, the deviation requiring a return of the locomotive device to the predefined trajectory; in response to the automatic ascertainment, automatically calculate a jerk as an input variable, as a function of the deviation from the predefined trajectory; automatically calculate an unconstrained correcting variable for the return to the predefined trajectory, as a function of a weighted sum including weighted summands of states for the return, which is a function of the input variable; automatically calculate a constrained correcting variable regarding the jerk, by manipulating the unconstrained correcting variable, using a cascade that includes a plurality of stages having one saturation function per stage, each stage of the plurality of stages including a saturation function regarding a specific dynamic system state; integrate the constrained correcting variable with respect to time, in order to obtain a constrained return trajectory to the predefined trajectory; and in response to the obtaining of the constrained return trajectory, automatically steer the locomotive device to the predefined trajectory using the constrained return trajectory. 